منابع مشابه
Interactive Access Rule Learning: Generating Adapted Access Rule Sets
This paper tackles the problem of usability and security in access control mechanisms. A theoretical solution for this problem is presented using the combination of automatic rule learning and user interaction. The result is the interactive rule learning approach. Interactive rule learning is designed to complete attribute-based access control to generate concise rule sets even by non-expert en...
متن کاملOn the competitiveness of the move-to-front rule
We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan 13] and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an oo-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competitive ...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولThe 50% advanced information rule of the quantum algorithms
The oracle chooses a function out of a known set of functions and gives to the player a black box that, given an argument, evaluates the function. The player should find out a certain character of the function (e. g. its period) through function evaluation. This is the typical problem addressed by the quantum algorithms. In former theoretical work, we showed that a quantum algorithm requires th...
متن کاملShort 2-Move Undeniable Signatures
Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication constraints. In this paper, we offer a solution to this problem in the context of undeniable signatures with interactive verification protocols by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 1989
ISSN: 2468-2438,1389-6911
DOI: 10.3233/icg-1989-12227